width and height resizing - traducción al árabe
Diclib.com
Diccionario ChatGPT
Ingrese una palabra o frase en cualquier idioma 👆
Idioma:

Traducción y análisis de palabras por inteligencia artificial ChatGPT

En esta página puede obtener un análisis detallado de una palabra o frase, producido utilizando la mejor tecnología de inteligencia artificial hasta la fecha:

  • cómo se usa la palabra
  • frecuencia de uso
  • se utiliza con más frecuencia en el habla oral o escrita
  • opciones de traducción
  • ejemplos de uso (varias frases con traducción)
  • etimología

width and height resizing - traducción al árabe

SUBSET OF INCOMPARABLE ELEMENTS IN A PARTIALLY ORDERED SET
Anti-chain; Width (partial order); Poset height; Poset width

width and height resizing      
التحكم فى عرض النافذة طولياً وعرضياً .
التحكم فى عرض النافذة طولياً وعرضياً      

width and height resizing

standing height         
DISTANCE FROM THE BOTTOM OF THE FEET TO THE TOP OF THE HEAD IN A HUMAN BODY, STANDING ERECT
Average height; Peak height velocity; Human stature; Height of humans; Body height; Growth spurt; Constitutional short stature; Race and height; Median height; Human Height; Standing height; Personal height; Human heights; Body growth; Height of a human being; Average human height; Average human length; Human length; Tall stature; List of tallest peoples; Physical stature; Human physical stature; Height of a human
‎ الطُّوْلُ الوُقوفِيّ‎

Definición

Wideness
·noun Large extent in all directions; broadness; greatness; as, the wideness of the sea or ocean.
II. Wideness ·noun The quality or state of being wide; breadth; width; great extent from side to side; as, the wideness of a room.

Wikipedia

Antichain

In mathematics, in the area of order theory, an antichain is a subset of a partially ordered set such that any two distinct elements in the subset are incomparable.

The size of the largest antichain in a partially ordered set is known as its width. By Dilworth's theorem, this also equals the minimum number of chains (totally ordered subsets) into which the set can be partitioned. Dually, the height of the partially ordered set (the length of its longest chain) equals by Mirsky's theorem the minimum number of antichains into which the set can be partitioned.

The family of all antichains in a finite partially ordered set can be given join and meet operations, making them into a distributive lattice. For the partially ordered system of all subsets of a finite set, ordered by set inclusion, the antichains are called Sperner families and their lattice is a free distributive lattice, with a Dedekind number of elements. More generally, counting the number of antichains of a finite partially ordered set is #P-complete.